Squashing minimum coverings of 6-cycles into minimum coverings of triples
نویسندگان
چکیده
منابع مشابه
Existence of incomplete resolvable minimum coverings of pairs by triples
For given positive integers u and v with u ≡ v ≡ 0 (mod 6), let IRC(u; v) denote an incomplete resolvable minimum covering of pairs by triples of order u having a hole of size v. It is proved in this paper that there exists such an IRC(u; v) if and only if u¿ 3v. c © 2003 Elsevier B.V. All rights reserved.
متن کاملThe intersection problem for minimum coverings of Kn by triples
A Steiner triple system (more simply, triple system) is a pair T) where S is the vertex set of the complete undirected graph Kn on n vertices and T is a collection of edge-disjoint triangles (triples) which partition the edge set of Kn. The number n is called the order of the triple system (S, T) and it has been known forever since 1847 of triple systems (= set of all n such that a triple syste...
متن کاملThe Doyen Wilson Theorem for Minimum Coverings with Triples
In this article necessary and sufficient conditions are found for aminimum covering ofKm with triples to be embedded in a minimum covering ofKn with triples. c © 1997 JohnWiley & Sons, Inc. J Combin Designs 5: 341–352, 1997
متن کاملUniversal Cycles for Minimum Coverings of Pairs by Triples, with Application to 2-Radius Sequences
A new ordering, extending the notion of universal cycles of Chung et al. (1992), is proposed for the blocks of k-uniform set systems. Existence of minimum coverings of pairs by triples that possess such an ordering is established for all orders. The application to the construction of short 2-radius sequences is given, along with some new 2-radius sequences found through a computer search.
متن کاملAlmost resolvable minimum coverings of complete graphs with 4-cycles
If the complete graph Kn has vertex set X, a minimum covering of Kn with 4-cycles, (X,C, P ), is a partition of the edges of Kn ∪ P into a collection C of 4-cycles, where P is a subgraph of λKn and the number of edges in P is as small as possible. An almost parallel class of a minimum covering of Kn with 4-cycles is a largest possible collection of vertex disjoint 4-cycles (so with n/4 4-cycles...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Aequationes mathematicae
سال: 2014
ISSN: 0001-9054,1420-8903
DOI: 10.1007/s00010-014-0312-4